Stabilizing Weighted Graphs
نویسندگان
چکیده
منابع مشابه
Stabilizing Weighted Graphs
An edge-weighted graph G = (V,E) is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as network bargaining games and cooperative matching games, because they characterize instances which admit stable outcomes. Motivated by this, in the last few yea...
متن کاملA Self-stabilizing Weighted Matching Algorithm
The problem of computing a matching in a graph involves creating pairs of neighboring nodes such that no node is paired more than once. Previous work on the matching problem has resulted in several selfstabilizing algorithms for finding a maximal matching in an unweighted graph. In this paper we present the first self-stabilizing algorithm for the weighted matching problem. We show that the alg...
متن کاملDecomposing Weighted Graphs
We solve the following problem: Can an undirected weighted graph G be partitioned into two non-empty induced subgraphs satisfying minimum constraints for the sum of edge weights at vertices of each subgraph? We show that this is possible for all constraints a(x), b(x) satisfying dG(x) ≥ a(x) + b(x) + 2WG(x), for every vertex x, where dG(x),WG(x) are, respectively, the sum and maximum of inciden...
متن کاملBipolar Weighted Argumentation Graphs
This paper discusses the semantics of weighted argumentation graphs that are biplor, i.e. contain both attacks and support graphs. The work builds on previous work by Amgoud, Ben-Naim et. al. [1, 2], which presents and compares several semantics for argumentation graphs that contain only supports or only attacks relationships, respectively.
متن کاملWeighted Alliances in Graphs
Let G = (V, E) be a graph and let W:V→N be a non-negative integer weighting of the vertices in V. A nonempty set of vertices S ⊆ V is called a weighted defensive alliance if ∀v ∈ S ,∑u∈N[v]∩S w(u) ≥ ∑x∈N(v)−S w(x). A non-empty set S ⊆ V is a weighted offensive alliance if ∀v ∈ δS ,∑u∈N(v)∩S w(u) ≥ ∑x∈N[v]−S w(x). A weighted alliance which is both defensive and offensive is called a weighted pow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2020
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2019.1034